منابع مشابه
Short Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm
Quartet-based phylogeny reconstruction methods, such as Quartet Puzzling, were introduced in the hope that they might be competitive with maximum likelihood methods, without being as computationally intensive. However, despite the numerous quartet-based methods that have been developed, their performance in simulation has been disappointing. In particular, Ranwez and Gascuel, the developers of ...
متن کاملQuartet Puzzling: A Quartet Maximum-Likelihood Method for Reconstructing Tree Topologies
A versatile method, quartet puzzling, is introduced to reconstruct the topology (branching pattern) of a phylogenetic tree based on DNA or amino acid sequence data. This method applies maximum-likelihood tree reconstruction to all possible quartets that can be formed from n sequences. The quartet trees serve as starting points to reconstruct a set of optimal n-taxon trees. The majority rule con...
متن کاملMolecular phylogenetics: parallelized parameter estimation and quartet puzzling
Exponential growth of the data available for molecular sequence analysis causes eminent need for methods to analyze large datasets in reasonable time. In molecular phylogenetics maximum-likelihood methods became very popular despite their vast need for computational power. During the last decades parallel computing has proven to be a valuable way to decrease running time of computationally inte...
متن کاملLetter to the Editor Bayesian Probabilities and Quartet Puzzling
Quartet puzzling (QP), a heuristic tree search procedure for maximum-likelihood trees, has recently been introduced (Strimmer and von Haeseler 1996). This method uses maximum-likelihood criteria for quartets of taxa which are then combined to form trees based on larger numbers of taxa. Thus, QP can be practically applied to data sets comprising a much greater number of taxa than can other searc...
متن کاملQuartet-net: a quartet-based method to reconstruct phylogenetic networks.
Phylogenetic networks can model reticulate evolutionary events such as hybridization, recombination, and horizontal gene transfer. However, reconstructing such networks is not trivial. Popular character-based methods are computationally inefficient, whereas distance-based methods cannot guarantee reconstruction accuracy because pairwise genetic distances only reflect partial information about a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2012
ISSN: 1748-7188
DOI: 10.1186/1748-7188-7-35